Dynamic combination of processes for sub-queries

ABSTRACT

A tool for combining common processes shared by at least two or more sub-queries within a query is provided. The tool determines the query with the at least two or more sub-queries. The tool determines whether one or more sub set relationships are shared between the at least two or more sub-queries. Responsive to a determination that one or more sub set relationships are shared between the at least two or more sub-queries, the tool determines an order class for the at least two or more sub-queries based on the one or more sub set relationships. The tool determines an access path for the query. The tool executes the access path during run-time for data accessing.

BACKGROUND OF THE INVENTION

The present invention relates generally to database queries, and moreparticularly to performance enhancements for database queries containingmultiple sub-queries.

Database management systems may utilize Structured Query Language (SQL)for data query processes and database access. SQL is a special-purposeprogramming language designed for managing data held in a relationaldatabase management system (RDBMS), or for stream processing in arelational data stream management system (RDSMS). With growth in bigdata analytics and data analyzing, SQL queries for statistics mayexpand.

SUMMARY

Aspects of an embodiment of the present invention disclose a method, acomputer system, and a computer program product for combining commonprocesses shared by at least two or more sub-queries within a query, inaccordance with an embodiment of the present invention. The methodincludes determining, by one or more computer processors, the query withthe at least two or more sub-queries. The method includes determining,by the one or more computer processors, whether one or more sub setrelationships are shared between the at least two or more sub-queries.Responsive to a determination that one or more sub set relationships areshared between the at least two or more sub-queries, determining, by theone or more computer processors, an order class for the at least two ormore sub-queries based on the one or more sub set relationships. Themethod includes determining, by the one or more computer processors, anaccess path for the query. The method includes executing, by the one ormore computer processors, the access path during run-time for dataaccessing.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a functional block diagram illustrating a data processingenvironment, in accordance with an embodiment of the present invention.

FIG. 2 is a flowchart depicting operational steps of a query optimizerprogram, in accordance with an embodiment of the present invention.

FIG. 3 is a block diagram depicting components of a data processingsystem (such as the server of FIG. 1), in accordance with an embodimentof the present invention.

DETAILED DESCRIPTION

Embodiments of the present invention recognize that to obtain differentresult values from two nearly identical sub-queries, processes arerepeated multiple times. Embodiments of the present invention recognizethat duplicated processes of similar sub-queries increase SQL executionand process costs. Embodiments of the present invention furtherrecognize that common table expressions (CTEs) do not provide an index,and often require a database to restore a temporary table as a work filein order to process a query request, which ultimately increases SQLexecution and process costs.

Embodiments of the present invention provide the capability to reducecosts associated with similar queries and expedite SQL execution of dataqueries containing multiple sub-queries with sub set relationships.Embodiments of the present invention provide the capability to adoptprevious temporary result sets generated from sub-queries based onshared sub set relationships instead of relying on full table access.Embodiments of the present invention provide the capability to determinesub set relationships between at least two or more sub-queries of aquery, and combine common processes shared by the at least two or moresub-queries to enhance the performance of the query containing multiplesub-queries.

Implementation of such embodiments may take a variety of forms, andexemplary implementation details are discussed subsequently withreference to the Figures.

The present invention will now be described in detail with reference tothe Figures. FIG. 1 is a functional block diagram illustrating a dataprocessing environment, generally designated 100, in accordance with anembodiment of the present invention. FIG. 1 provides only anillustration of one implementation and does not imply any limitationswith regard to the environments in which different embodiments may beimplemented. Many modifications to the depicted environment may be madeby those skilled in the art without departing from the scope of theinvention as recited by the claims. FIG. 1 includes network 102, server104, and one or more client computers, such as client computer 106 andclient computer 108, and database 110.

In one embodiment, network 102 is the Internet representing a worldwidecollection of networks and gateways that use TCP/IP protocols tocommunicate with one another. Network 102 may include wire cables,wireless communication links, fiber optic cables, routers, switches,and/or firewalls. Server 104, client computer 106, client computer 108,and database 110 are interconnected by network 102. Network 102 can beany combination of connections and protocols capable of supportingcommunications between server 104, client computer 106, client computer108, database 110 and query optimizer program 112. Network 102 may alsobe implemented as a number of different types of networks, such as anintranet, a local area network (LAN), a virtual local area network(VLAN), or a wide area network (WAN). FIG. 1 is intended as an exampleand not as an architectural limitation for the different embodiments.

In one embodiment, server 104 may be, for example, a server computersystem, such as a database server, a management server, a web server, astructured query language server, or any other electronic device orcomputing system capable of sending and receiving data. In anotherembodiment, server 104 may be a data center consisting of a collectionof networks and servers providing an IT service, such as virtual serversand applications deployed on virtual servers, to an external party. Inone embodiment, server 104 may be a database server operating on alegacy system, such as a mainframe system. In another embodiment, server104 represents a “cloud” of computers interconnected by one or morenetworks, where server 104 is a computing system utilizing clusteredcomputers and components to act as a single pool of seamless resourceswhen accessed through network 102. This is a common implementation fordata centers in addition to cloud computing applications. In theexemplary embodiment, server 104 includes query optimizer program 112for combining common processes shared by at least two or moresub-queries to reduce costs associated with similar queries and expediteSQL execution.

In one embodiment, query optimizer program 112 operates on a centralserver, such as server 104, and can be utilized by one or more clientcomputers, such as client computer 106 and client computer 108, vianetwork 102. In another embodiment, query optimizer program 112 may be asoftware-based program downloaded from the central server, such asserver 104, or a third-party provider (not shown), and executed on aclient computer, such as client computer 106 and client computer 108, tocombine common processes shared by at least two or more sub-queries toreduce costs associated with similar queries and expedite SQL execution.In another embodiment, query optimizer program 112 may be asoftware-based program, downloaded from a central server, such as server104, and installed on one or more client devices, such as clientcomputer 106 and client computer 108. In yet another embodiment, queryoptimizer program 112 may be utilized as a software service provided bya third-party cloud service provider (not shown). In yet anotherembodiment, query optimizer program 112 may include one or moresoftware-based components, such as add-ons, plug-ins, and agentprograms, etc., installed on one or more client devices, such as clientcomputer 106 and client computer 108, to combine common processes sharedby at least two or more sub-queries to reduce costs associated withsimilar queries and expedite SQL execution.

In one embodiment, query optimizer program 112 is a software-basedprogram for combining common processes shared by at least two or moresub-queries to reduce costs associated with similar queries and expediteSQL execution. In one embodiment, query optimizer program 112 provides amechanism for reducing costs associated with similar queries andexpediting SQL execution by combining common processes shared by atleast two or more sub-queries. In one embodiment, query optimizerprogram 112 detects there are at least two or more sub-queries in an SQLquery. In one embodiment, query optimizer program 112 determines whetherthe at least two or more sub-queries share similar basic data accessprocesses (e.g., access paths). In one embodiment, query optimizerprogram 112 combines similar basic data access processes together toavoid duplicated processes in order to achieve a desired results set.

In one embodiment, client computer 106 and client computer 108 areclients to server 104 and may be, for example, a server, a desktopcomputer, a laptop computer, a tablet computer, a personal digitalassistant (PDA), a smart phone, a thin client, or any other electronicdevice or computing system capable of communicating with server 104through network 102. For example, client computer 106 and clientcomputer 108 may be a laptop computer capable of connecting to anetwork, such as network 102, to submit one or more data queries to acentral server to utilize a software-based program, such as queryoptimizer program 112 of server 104. In one embodiment, client computer106 and client computer 108 may be any suitable type of client devicecapable of submitting one or more data queries to a database server(e.g., SQL server). In one embodiment, client computer 106 and clientcomputer 108 include a user interface (not shown) for submitting dataqueries to a database server, such as server 104. There are many typesof user interfaces. In one embodiment, the user interface may be agraphical user interface (GUI). A GUI is a type of user interface thatallows users to interact with electronic devices, such as a keyboard andmouse, through graphical icons and visual indicators, such as secondarynotations, as opposed to text-based interfaces, typed command labels, ortext navigation. In computers, GUIs were introduced in reaction to theperceived steep learning curves of command-line interfaces, whichrequired commands to be typed on the keyboard. The actions in GUIs areoften performed through direct manipulation of the graphics elements.

In one embodiment, database 110 is a storage device (e.g., storagerepository, database, etc.) interconnected with a database server, suchas server 104. In one embodiment, database 110 provides the capabilityto store data accessible by SQL executions and data queries.

FIG. 2 depicts a flowchart of operational steps of a query optimizerprogram, such as query optimizer program 112 of FIG. 1, generallydesignated 200, for combining common processes shared by at least two ormore sub-queries to reduce costs associated with similar queries andexpedite SQL execution, in accordance with an embodiment of the presentinvention.

Query optimizer program 112 determines a query with at least two or moresub-queries (202). In one embodiment, responsive to a database server,such as server 104, receiving a query (SQL query) from a clientcomputer, such as client computer 106 and client computer 108, queryoptimizer program 112 determines a query with at least two or moresub-queries by scanning the query to determine whether there are atleast two or more sub-queries within the query. In one embodiment, queryoptimizer program 112 scans the query for at least two distinct dataprocesses within the query SQL (textual language, command language,etc.), where the at least two distinct data processes may be indicatedby query language, such as textual query language, command language,query type, and a transition term between the at least two distinct dataprocesses, etc. For example, responsive to receiving a query forstatistics on how many devices are related in a table and how manyrecords are located in the table, query optimizer program 112 may scanthe query and determine that the query includes two sub-queriesevidenced by two distinct query types having differing command language,such as a MALL_COMMAND sub-query and a STORE_OUT sub-query in the SQLprocess.

Query optimizer program 112 determines whether one or more sub setrelationships are shared between the at least two or more sub-queries(204). In one embodiment, query optimizer program 112 determines whetherone or more sub set relationships, such as common data processes, areshared between the at least two or more sub-queries by analyzingrespective predicates within the at least two or more sub-queries. Forexample, query optimizer program 112 may analyze respective predicatesof two sub-queries and determine that the data processes share commondata processes, such as a first sub-query requiring a common dataprocess shared by a second sub-query, and that differ in at least oneaspect, such as the first sub-query differing from the second sub-queryby requiring a count number of devices, where the second sub-queryinstead requires a distinct list of the devices, and in this case, queryoptimizer program 112 may determine that the two sub-queries sharesub-set relationships (i.e., similar or same shared data processes) anddiffer in at least one aspect of the shared data processes. Where queryoptimizer program 112 determines that at least two or more sub-queriesshare similar data processes, query optimizer program 112 determinesthat one or more sub set relationships are shared between the at leasttwo or more queries. Where query optimizer program 112 determines thatat least two or more sub-queries do not share similar data processes,query optimizer program 112 determines that one or more sub setrelationships are not shared between the at least two or more queries.

Responsive to a determination that at least two or more sub-queries donot share similar data processes, query optimizer program 112 determinesthat one or more sub set relationships are not shared between the atleast two or more queries (NO branch, 204), query optimizer program 112returns to detecting a query with at least two or more sub-queries(202).

Responsive to a determination that similar data processes are sharedbetween the at least two or more sub-queries, query optimizer program112 determines that one or more sub set relationships are shared betweenthe at least two or more sub-queries (YES branch 204), query optimizerprogram 112 determines an order class for the at least two or moresub-queries based on the one or more sub set relationships (206). In oneembodiment, query optimizer program 112 determines an order class forthe at least two or more sub-queries, where an order class is an orderof one or more data processes within the query based, at least in part,on query style, type, function, etc. In another embodiment, an orderclass may be based on the one or more sub set relationships. In yetanother embodiment, an order class is an order of one or more dataprocesses as they appear in the SQL of a query as is known in the art.In one embodiment, query optimizer program 112 may determine an orderclass for the at least two or more sub-queries by marking common dataprocesses shared between the one or more sub-queries, combining commondata processes of the two or more sub-queries into a single sharedcommon process, and transforming the query (e.g., SQL transformation,transforming a parse tree, etc.) to include the differing data processeswithin the single shared common process, with the differing dataprocesses arranged based on a query style, a query type, and a queryfunction, etc. In one embodiment, query optimizer program 112 mayreplace the original location of the data processes with a signed node.

Query optimizer program 112 determines an access path for the query(208). In one embodiment, based on a query transformation, queryoptimizer program 112 determines an access path for the query based, atleast in part, on a comparison of a cost associated with dynamicallygenerating a temporary result set against some sub-queries that may bereused by other sub-queries with a cost associated with the at least twoor more sub-queries of the original query accessing one or more basetables. In one embodiment, query optimizer program 112 may determine thecost associated with dynamically generating a temporary result setagainst some sub-queries that may be reused by other sub-queries, anddetermine the cost associated with the at least two or more sub-queriesof the original query accessing one or more base tables, wherein thecost may be a performance cost, a financial cost, and a time cost, etc.In another embodiment, query optimizer program 112 may retrieve the costassociated with dynamically generating a temporary result set againstsome sub-queries that may be reused by other sub-queries, and the costassociated with the at least two or more sub-queries of the originalquery accessing one or more base tables from a database, such asdatabase 110. In one embodiment, query optimizer program 112 generatesan access path for the single shared common process, where the accesspath includes one or more different branches in a parse tree forrespective differing data processes of the at least two or moresub-queries within the single shared common process. For example, queryoptimizer program 112 may generate an access path that includes a firstbranch for a count value, and a second branch for a distinct list, suchthat query returns two distinct result sets. In one embodiment,responsive to a determination that the cost associated with dynamicallygenerating a temporary result set against some sub-queries that may bereused by other sub-queries is less than the cost associated with the atleast two or more sub-queries of the original query accessing one ormore base tables from a database, query optimizer program 112 generatesa plurality of temporary results sets against some sub-queries for theadoption of other sub-queries instead of accessing one or more basetables for results sets, thereby effectively expediting SQL executionand enhancing the performance of the query.

Query optimizer program 112 executes the access path during run-time fordata accessing (210). In one embodiment, query optimizer program 112connects the plurality of temporary results sets and the single sharedcommon process (i.e., the transformed query). In one embodiment, queryoptimizer program 112 supports the access path with the single sharedcommon process for data accessing, and returns one or more results setsbased, at least in part, on the number of different branches in thequery. For example, typically a single result set is returned for asingle sub-query, however, the access path with the single shared commonprocess returns two result sets, such as one for a count value and onefor a distinct list, as the distinct data processes for each arecombined in the single shared common process as different branches, suchthat each distinct data process branch is executed simultaneously in thequery to avoid multiple repetitions of the query to achieve the sameresult sets.

FIG. 3 depicts a block diagram of components of data processing system,such as server 104 of FIG. 1, generally designated 300, in accordancewith an illustrative embodiment of the present invention. It should beappreciated that FIG. 3 provides only an illustration of oneimplementation and does not imply any limitations with regard to theenvironments in that different embodiments may be implemented. Manymodifications to the depicted environment may be made.

In the illustrative embodiment, server 104 in data processingenvironment 100 is shown in the form of a general-purpose computingdevice, such as computer system 310. The components of computer system310 may include, but are not limited to, one or more processors orprocessing unit(s) 314, memory 324, and bus 316 that couples varioussystem components including memory 324 to processing unit(s) 314.

Bus 316 represents one or more of any of several types of busstructures, including a memory bus or memory controller, a peripheralbus, an accelerated graphics port, and a processor or local bus usingany of a variety of bus architectures. By way of example, and notlimitation, such architectures include Industry Standard Architecture(ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA)bus, Video Electronics Standards Association (VESA) local bus, andPeripheral Component Interconnect (PCI) bus.

Computer system 310 typically includes a variety of computer systemreadable media. Such media may be any available media that is accessibleby computer system 310, and it includes both volatile and non-volatilemedia, removable and non-removable media.

Memory 324 can include computer system readable media in the form ofvolatile memory, such as random access memory (RAM) 326 and/or cachememory 328. Computer system 310 may further include otherremovable/non-removable, volatile/non-volatile computer system storagemedia. By way of example only, storage system 330 can be provided forreading from and writing to a non-removable, non-volatile magnetic media(not shown and typically called a “hard drive”). Although not shown, amagnetic disk drive for reading from and writing to a removable,non-volatile magnetic disk (e.g., a “floppy disk”), and an optical diskdrive for reading from or writing to a removable, non-volatile opticaldisk, such as a CD-ROM, DVD-ROM, or other optical media can be provided.In such instances, each can be connected to bus 316 by one or more datamedia interfaces. As will be further depicted and described below,memory 324 may include at least one computer program product having aset (e.g., at least one) of program modules that are configured to carryout the functions of embodiments of the invention.

Program/utility 332, having one or more sets of program modules 334, maybe stored in memory 324 by way of example, and not limitation, as wellas an operating system, one or more application programs, other programmodules, and program data. Each of the operating systems, one or moreapplication programs, other program modules, and program data, or somecombination thereof, may include an implementation of a networkingenvironment. Program modules 334 generally carry out the functionsand/or methodologies of embodiments of the invention as describedherein. Computer system 310 may also communicate with one or moreexternal device(s) 312, such as a keyboard, a pointing device, a display322, etc., or one or more devices that enable a user to interact withcomputer system 310 and any devices (e.g., network card, modem, etc.)that enable computer system 310 to communicate with one or more othercomputing devices. Such communication can occur via Input/Output (I/O)interface(s) 320. Still yet, computer system 310 can communicate withone or more networks, such as a local area network (LAN), a general widearea network (WAN), and/or a public network (e.g., the Internet) vianetwork adapter 318. As depicted, network adapter 318 communicates withthe other components of computer system 310 via bus 316. It should beunderstood that although not shown, other hardware and softwarecomponents, such as microcode, device drivers, redundant processingunits, external disk drive arrays, RAID systems, tape drives, and dataarchival storage systems may be used in conjunction with computer system310.

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++, or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, a special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the Figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

The descriptions of the various embodiments of the present inventionhave been presented for purposes of illustration, but are not intendedto be exhaustive or limited to the embodiments disclosed. Manymodifications and variations will be apparent to those of ordinary skillin the art without departing from the scope and spirit of the invention.The terminology used herein was chosen to best explain the principles ofthe embodiment, the practical application or technical improvement overtechnologies found in the marketplace, or to enable others of ordinaryskill in the art to understand the embodiments disclosed herein.

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of the invention. Itshould be appreciated that any particular nomenclature herein is usedmerely for convenience and thus, the invention should not be limited touse solely in any specific function identified and/or implied by suchnomenclature. Furthermore, as used herein, the singular forms of “a”,“an”, and “the” are intended to include the plural forms as well, unlessthe context clearly indicates otherwise.

What is claimed is:
 1. A method for combining common processes shared byat least two or more sub-queries within a query, the method comprising:determining, by one or more computer processors, the query with the atleast two or more sub-queries; determining, by the one or more computerprocessors, whether one or more sub set relationships are shared betweenthe at least two or more sub-queries; responsive to a determination thatone or more sub set relationships are shared between the at least two ormore sub-queries, determining, by the one or more computer processors,an order class for the at least two or more sub-queries based on the oneor more sub set relationships, wherein determining the order classincludes marking one or more common data processes shared between the atleast two or more sub-queries, combining the one or more common dataprocesses of the at least two or more sub-queries into a single sharedcommon process, transforming the query to include one or more differingaspects within the single shared common process, with the one or morediffering aspects arranged based, at least in part, on a query style, aquery type, and a query function, and replacing an original location ofthe one or more common data processes with a signed node; determining,by the one or more computer processors, an access path for the query;and executing, by the one or more computer processors, the access pathduring run-time for data accessing.
 2. The method of claim 1, whereindetermining the query with the at least two or more sub-queries, furthercomprises: scanning, by the one or more computer processors, the queryto determine whether there are at least two or more sub-queries withinthe query.
 3. The method of claim 1, wherein determining whether one ormore sub set relationships are shared between the at least two or moresub-queries, further comprises: determining, by the one or more computerprocessors, whether the at least two or more sub-queries share a commondata process and differ in at least one aspect of the common dataprocess, wherein determining includes analyzing one or more respectivepredicates of the at least two or more sub-queries.
 4. The method ofclaim 3, further comprises: responsive to a determination that the atleast two or more sub-queries share a common data process and differ inat least one aspect of the common data process, determining, by the oneor more computer processors, one or more sub set relationships areshared between the at least two or more sub-queries; and responsive to adetermination that the at least two or more sub-queries do not share acommon data process and do not differ in at least one aspect of thecommon data process, determining, by the one or more computerprocessors, one or more sub set relationships are not shared between theat least two or more sub-queries.
 5. The method of claim 1, whereindetermining an access path for the query, further comprises:determining, by the one or more computer processors, a cost associatedwith dynamically generating a temporary result set against somesub-queries that may be reused by one or more other sub-queries;determining, by the one or more computer processors, a cost associatedwith the at least two or more sub-queries of the query accessing one ormore base tables; and responsive to a determination that the costassociated with dynamically generating the temporary result set againstsome sub-queries that may be reused by the one or more other sub-queriesis less than the cost associated with the at least two or moresub-queries of the query accessing the one or more base tables,generating, by the one or more computer processors, an access path for asingle shared common process, wherein the access path includes two ormore different branches in a parse tree for each of two or morediffering aspects within the single shared common process, wherein thetwo or more different branches return two or more results sets.
 6. Themethod of claim 5, further comprises: responsive to a determination thatthe cost associated with dynamically generating the temporary result setagainst some sub-queries that may be reused by the one or more othersub-queries is less than the cost associated with the at least two ormore sub-queries of the query accessing the one or more base tables,generating, by the one or more computer processors, a plurality oftemporary results sets against the at least two or more sub-queries foradoption by the one or more other sub-queries instead of accessing theone or more base tables for results sets.
 7. A computer program productfor combining common processes shared by at least two or moresub-queries within a query, the computer program product comprising: oneor more computer readable storage media and program instructions storedon the one or more computer readable storage media, the programinstructions comprising: program instructions to determine the querywith the at least two or more sub-queries; program instructions todetermine whether one or more sub set relationships are shared betweenthe at least two or more sub-queries; responsive to a determination thatone or more sub set relationships are shared between the at least two ormore sub-queries, program instructions to determine an order class forthe at least two or more sub-queries based on the one or more sub setrelationships, wherein determining the order class includes marking oneor more common data processes shared between the at least two or moresub-queries, combining the one or more common data processes of the atleast two or more sub-queries into a single shared common process,transforming the query to include one or more differing aspects withinthe single shared common process, with the one or more differing aspectsarranged based, at least in part, on a query style, a query type, and aquery function, and replacing an original location of the one or morecommon data processes with a signed node; program instruction todetermine an access path for the query; and program instructions toexecute the access path during run-time for data accessing.
 8. Thecomputer program product of claim 7, wherein program instructions todetermine the query with the at least two or more sub-queries, furthercomprise: program instructions to scan the query to determine whetherthere are at least two or more sub-queries within the query.
 9. Thecomputer program product of claim 7, wherein program instructions todetermine whether one or more sub set relationships are shared betweenthe at least two or more sub-queries, further comprise: programinstructions to determine whether the at least two or more sub-queriesshare a common data process and differ in at least one aspect of thecommon data process, wherein determining includes analyzing one or morerespective predicates of the at least two or more sub-queries.
 10. Thecomputer program product of claim 9, further comprising: responsive to adetermination that the at least two or more sub-queries share a commondata process and differ in at least one aspect of the common dataprocess, program instructions to determine one or more sub setrelationships are shared between the at least two or more sub-queries;and responsive to a determination that the at least two or moresub-queries do not share a common data process and do not differ in atleast one aspect of the common data process, program instructions todetermine one or more sub set relationships are not shared between theat least two or more sub-queries.
 11. The computer program product ofclaim 7, wherein program instructions to determine an access path forthe query, further comprise: program instructions to determine a costassociated with dynamically generating a temporary result set againstsome sub-queries that may be reused by one or more other sub-queries;program instructions to determine a cost associated with the at leasttwo or more sub-queries of the query accessing one or more base tables;and responsive to a determination that the cost associated withdynamically generating the temporary result set against some sub-queriesthat may be reused by the one or more other sub-queries is less than thecost associated with the at least two or more sub-queries of the queryaccessing the one or more base tables, program instructions to generatean access path for a single shared common process, wherein the accesspath includes two or more different branches in a parse tree for each oftwo or more differing aspects within the single shared common process,wherein the two or more different branches return two or more resultssets.
 12. The computer program product of claim 11, further comprising:responsive to a determination that the cost associated with dynamicallygenerating the temporary result set against some sub-queries that may bereused by the one or more other sub-queries is less than the costassociated with the at least two or more sub-queries of the queryaccessing the one or more base tables, program instructions to generatea plurality of temporary results sets against the at least two or moresub-queries for adoption by the one or more other sub-queries instead ofaccessing the one or more base tables for results sets.
 13. A computersystem for combining common processes shared by at least two or moresub-queries within a query, the computer system comprising: one or morecomputer processors; one or more computer readable storage media;program instructions stored on at least one of the one or more computerreadable storage media for execution by at least one of the one or morecomputer processors, the program instructions comprising: programinstructions to program instructions to determine the query with the atleast two or more sub-queries; program instructions to determine whetherone or more sub set relationships are shared between the at least two ormore sub-queries; responsive to a determination that one or more sub setrelationships are shared between the at least two or more sub-queries,program instructions to determine an order class for the at least two ormore sub-queries based on the one or more sub set relationships, whereindetermining the order class includes marking one or more common dataprocesses shared between the at least two or more sub-queries, combiningthe one or more common data processes of the at least two or moresub-queries into a single shared common process, transforming the queryto include one or more differing aspects within the single shared commonprocess, with the one or more differing aspects arranged based, at leastin part, on a query style, a query type, and a query function, andreplacing an original location of the one or more common data processeswith a signed node; program instruction to determine an access path forthe query; and program instructions to execute the access path duringrun-time for data accessing.
 14. The computer system of claim 13,wherein program instructions to determine the query with the at leasttwo or more sub-queries, further comprise: program instructions to scanthe query to determine whether there are at least two or moresub-queries within the query.
 15. The computer system of claim 13,wherein program instructions to determine whether one or more sub setrelationships are shared between the at least two or more sub-queries,further comprise: program instructions to determine whether the at leasttwo or more sub-queries share a common data process and differ in atleast one aspect of the common data process, wherein determiningincludes analyzing one or more respective predicates of the at least twoor more sub-queries.
 16. The computer system of claim 15, furthercomprising: responsive to a determination that the at least two or moresub-queries share a common data process and differ in at least oneaspect of the common data process, program instructions to determine oneor more sub set relationships are shared between the at least two ormore sub-queries; and responsive to a determination that the at leasttwo or more sub-queries do not share a common data process and do notdiffer in at least one aspect of the common data process, programinstructions to determine one or more sub set relationships are notshared between the at least two or more sub-queries.
 17. The computersystem of claim 13, wherein program instructions to determine an accesspath for the query, further comprise: program instructions to determinea cost associated with dynamically generating a temporary result setagainst some sub-queries that may be reused by one or more othersub-queries; program instructions to determine a cost associated withthe at least two or more sub-queries of the query accessing one or morebase tables; and responsive to a determination that the cost associatedwith dynamically generating the temporary result set against somesub-queries that may be reused by the one or more other sub-queries isless than the cost associated with the at least two or more sub-queriesof the query accessing the one or more base tables, program instructionsto generate an access path for a single shared common process, whereinthe access path includes two or more different branches in a parse treefor each of two or more differing aspects within the single sharedcommon process, wherein the two or more different branches return two ormore results sets.